Orthogonal Negation for Document Re-ranking
نویسندگان
چکیده
In this work, we propose a method for document re-ranking, which exploits negative feedback represented by non-relevant documents. The concept of non-relevance is modelled through the quantum negation operator. The evaluation carried out on a standard collection shows the effectiveness of the proposed method in both the classical Vector Space Model and a Semantic Document Space.
منابع مشابه
A Re-Ranking Method Based on Irrelevant Documents in Ad-Hoc Retrieval
In this paper, we propose a novel approach for document re-ranking, which relies on the concept of negative feedback represented by irrelevant documents. In a previous paper, a pseudo-relevance feedback method is introduced using an absorbing document d̃ which best fits the user’s need. The document d̃ is orthogonal to the majority of irrelevant documents. In this paper, this document is used to ...
متن کاملNegation for Document Re-ranking in Ad-hoc Retrieval
Information about top-ranked documents plays a key role to improve retrieval performance. One of the most common strategies which exploits this kind of information is relevance feedback. Few works have investigated the role of negative feedback on retrieval performance. This is probably due to the difficulty of dealing with the concept of nonrelevant document. This paper proposes a novel approa...
متن کاملSupporting the Negation Operator in the Hermes Graphical Query Language for Document Ranking
Hermes is a Web-based framework designed to build personalized news services using Semantic Web technologies. Users of Hermes query news items using the Hermes Graphical Query Language (HGQL), which makes it possible to create complex queries without any knowledge of specific query languages. In this paper, we propose a document ranking model that can be used with HGQL and that supports the use...
متن کاملOrthogonal Negation in Vector Spaces for Modelling Word-Meanings and Document Retrieval
Standard IR systems can process queries such as “web NOT internet”, enabling users who are interested in arachnids to avoid documents about computing. The documents retrieved for such a query should be irrelevant to the negated query term. Most systems implement this by reprocessing results after retrieval to remove documents containing the unwanted string of letters. This paper describes and e...
متن کاملCircular Re-ranking for Visual Search
Conventional approaches to visual search re-ranking empirically take the “classification performance” as the optimization objective, in which each visual document is determined relevant or not, followed by a process of increasing the order of relevant documents. First show that the classification performance fails to produce a globally optimal ranked list, and then formulate re-ranking as an op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012